1
کامپیوتر و شبکه::
ضرب اسکالر
Notable features of our achievable schemes include the use of cross- subspace alignment and a transformation argument that converts a scalar multiplication problem into a scalar addition problem, allowing a surprisingly efficient solution.
A notable aspect of our upper bounds is a connection between SDMM and a form of private information retrieval (PIR) problem, known as multi-message X-secure T -private information retrieval (MM-XSTPIR).2 Interesting features of our achievable schemes include the idea of cross-subspace alignment that was introduced in [6] and was recently applied to SDMM in [7], and a novel transformation argument that converts a scalar multiplication problem into a scalar addition problem.
The transformation allows a surprisingly3 efficient (and capacity optimal) solution for scalar multiplication, outer products of vectors, and Hadamard products of matrices.
On the other hand, since the Hadamard product is the entrywise product of matrices, thus the scalar multiplication scheme presented in Section 5.4.1 achieves the capacity.
Therefore it is possible to translate scalar multiplication over F× into addition modulo (q − 1).
واژگان شبکه مترجمین ایران